Some high-order zero-finding methods using almost orthogonal polynomials
نویسندگان
چکیده
منابع مشابه
Some High-order Zero-finding Methods Using Almost Orthogonal Polynomials
Some multipoint iterative methods without memory, for approximating simple zeros of functions of one variable, are described. For m > 0, n ≥ 0, and k satisfying m+1 ≥ k > 0, there exist methods which, for each iteration, use one evaluation of f, f ′, . . . , f (m), followed by n evaluations of f (k), and have order of convergence m + 2n + 1. In particular, there are methods of order 2(n+1) whic...
متن کاملTrajectory Planning Using High Order Polynomials under Acceleration Constraint
The trajectory planning, which is known as a movement from starting to end point by satisfying the constraints along the path is an essential part of robot motion planning. A common way to create trajectories is to deal with polynomials which have independent coefficients. This paper presents a trajectory formulation as well as a procedure to arrange the suitable trajectories for applications. ...
متن کاملZero Asymptotic Behaviour for Orthogonal Matrix Polynomials
Weak-star asymptotic results are obtained for the zeros of orthogonal matrix polynomials (i.e. the zeros of their determinants) on R from two di®erent assumptions: ̄rst from the convergence of matrix coe±cients occurring in the three-term recurrence for these polynomials and, second, from some conditions on the generating matrix measure. The matrix analogue of the Chebyshev polynomials of the ̄...
متن کاملZero Location for Nonstandard Orthogonal Polynomials
A method to locate the zeros of orthogonal polynomials with respect to non-standard inner products is discussed and applied to Sobolev orthogonal polyno-mials and polynomials satisfying higher-order recurrence relations.
متن کاملA new family of four-step fifteenth-order root-finding methods with high efficiency index
In this paper a new family of fifteenth-order methods with high efficiency index is presented. This family include four evaluations of the function and one evaluation of its first derivative per iteration. Therefore, this family of methods has the efficiency index which equals 1.71877. In order to show the applicability and validity of the class, some numerical examples are discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
سال: 1975
ISSN: 0334-2700,1839-4078
DOI: 10.1017/s0334270000000916